History Sensitive Cascade Model
نویسندگان
چکیده
منابع مشابه
History Sensitive Cascade Model
Diffusion is a process by which information, viruses, ideas, or new behavior spread over social networks. Traditional diffusion models are history insensitive, i.e. only giving activated nodes a one-time chance to activate each of its neighboring nodes with some probability. But history dependent interactions between people are often observed in the real world. This paper proposes the History S...
متن کاملHistory Sensitive Cascade Model, Midterm Report
We introduce and define the History Sensitive Cascade Model. We then explore how vertices are activated in this model. We introduce the notion of how many vertices are expected to be activated after some time, given that some vertices are active initially. We show that this is NP-hard to compute exactly, and use submodularity to provide a lower bound on the approximation found by a greedy algor...
متن کاملA History Sensitive Diffusion Network: Preliminary Model and Simulation
Diffusion is a process by which information, viruses, ideas and new behavior spread over social networks. The traditional independent cascade model gives activated nodes a one-time chance to activate each of its neighboring nodes with some probability. This paper extends the traditional model to an iterative fashion. We propose a model called the iterative cascade model that allows activated no...
متن کاملHistory-Sensitive Error Recovery
We present a novel approach to incremental recovery from lexical and syntactic errors in an interactive software development environment. Unlike existing techniques, we utilize the history of changes to the program to discover the natural correlation between user modifications and errors detected during incremental lexical and syntactic analysis. Our technique is non-correcting—the analysis ref...
متن کاملCost-sensitive cascade graph neural networks
This paper introduces a novel cost sensitive weighted samples approach to a cascade of Graph Neural Networks for learning from imbalanced data in the graph structured input domain. This is shown to be very effective in addressing the effects of imbalanced data distribution on learning systems. The proposed idea is based on a weighting mechanism which forces the network to encode misclassified g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Agent Technologies and Systems
سال: 2011
ISSN: 1943-0744,1943-0752
DOI: 10.4018/jats.2011040104